Constraint-based Timetabling

نویسنده

  • Tomáš Müller
چکیده

Acknowledgements Many thanks to Doc. RNDr. Roman Barták, PhD. for patient and systematic guidance in creation of this Ph.D. thesis.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using fuzzy c-means clustering algorithm for common lecturer timetabling among departments

University course timetabling problem is one of the hard problems and it must be done for each term frequently which is an exhausting and time consuming task. The main technique in the presented approach is focused on developing and making the process of timetabling common lecturers among different departments of a university scalable. The aim of this paper is to improve the satisfaction of com...

متن کامل

Distributed University Timetabling with Multiply Sectioned Constraint Networks

Although timetabling has long been studied through constraint satisfaction based techniques, along with many alternatives, only recently work has been reported where distributed timetabling problems (DisTTPs) was studied as distributed constraint satisfaction problems (DisCSPs). We present an alternative method for solving DisTTPs based on multiply sectioned constraint networks (MSCNs). The pro...

متن کامل

System Demonstration of Interactive Course Timetabling

This system demonstration presents an approach to interactive timetabling used by the UniTime university timetabling system. This application, which is publicly available under an open source license, has been successfully applied at Purdue University [8], a large public university (39,000 students) with a broad spectrum of programs at the undergraduate and graduate levels. The complete system ...

متن کامل

Employee Timetabling, Constraint Networks and Knowledge-Based Rules: A Mixed Approach

Employee Timetabling Problems (ETP) are all around us. One possible approach for solving ETPs is to use constraint processing techniques. Another approach that has been used many times in the past is to model human knowledge into knowledge-based systems for timetabling. It is diicult to represent the complex constraints of timetabling explicitly in constraint networks. On the other hand, knowle...

متن کامل

Combining rules and constraints for employee timetabling

Employee Timetabling Problems (ETP) are all around us. One possible approach for solving ETPs is to use constraint processing techniques. Another approach is to model human knowledge which is commonly used for solving such problems into knowledge-based systems for timetabling. It is diicult to represent the complex constraints of timetabling explicitly in constraint networks. On the other hand,...

متن کامل

A Heuristic Approach to Constraint Optimization in Timetabling

Timetabling is a difficult (NP-complete) problem and belongs to a general class of problems known as scheduling. Due to a variety of constraints typical in different timetabling environments, it has been difficult to develop a generic solution for timetabling. This paper is an attempt to define a generic computational model for examination timetabling for predefined constraints found in the pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002